Path planning in uncertain environment by using firefly algorithm
نویسندگان
چکیده
منابع مشابه
Improved speciation-based Firefly Algorithm in dynamic and uncertain environment
Many real-world optimization problems are dynamic in nature. The applied algorithm in this environment can pose serious challenges, especially when the search space is multimodal with multiple, time-varying optima. To address these challenges, this paper investigates a speciation-based firefly algorithm to enhance the population diversity with aim of generating several populations in different ...
متن کاملA Modified Firefly Algorithm for UCAV Path Planning
Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original firefly algorithm (FA) is used to solve the UCAV path planning problem. Furthermore, a new modified firefly algorithm (MFA) is prop...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملqfd planning with cost consideration in fuzzy environment
در عصر حاضر که رقابت بین سازمان ها بسیار گسترش یافته است، مطالعه و طرحریزی سیستم های تولیدی و خدماتی به منظور بهینه سازی عملکرد آنها اجتناب ناپذیر می باشد. بخش عمده ای از رقابت پذیری سازمان ها نتیجه رضایتمندی مشتریان آنها است. میزان موفقیت سازمان های امروزی به تلاش آنها در جهت شناسایی خواسته ها و نیازهای مشتریان و ارضای این نیازها بستگی دارد. از طرفی کوتاه کردن زمان ارائه محصول/خدمات به مشتریان...
15 صفحه اولFuzzy Dijkstra algorithm for shortest path problem under uncertain environment
A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In this paper, a generalized Dijkstra algorithm is proposed to handle SPP in an uncertain environment. Two key issues need to be addressed in SPP with fuzzy parameters. One is how to determine the addition of two edges. The other is how to compare the distance between two different paths with vailable online ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Defence Technology
سال: 2018
ISSN: 2214-9147
DOI: 10.1016/j.dt.2018.06.004